Some efficient computational algorithms related to phase models
نویسندگان
چکیده
منابع مشابه
Efficient algorithms for new computational models
Advances in hardware design and manufacturing often lead to new ways in which problems can be solved computationally. In this thesis we explore fundamental problems in three computational models that are based on such recent advances. The first model is based on new chip architectures, where multiple independent processing units are placed on one chip, allowing for an unprecedented parallelism ...
متن کاملSome Computational Problems Related to Pseudo-intents
We investigate the computational complexity of several decision, enumeration and counting problems related to pseudo-intents. We show that given a formal context and a set of its pseudo-intents, checking whether this context has an additional pseudo-intent is in conp and it is at least as hard as checking whether a given simple hypergraph is saturated. We also show that recognizing the set of p...
متن کاملAdaptive algorithms for phase field models of some interface problems
We present our on-going works with current and former colleagues at Penn State (L.Q. Chen, W.M. Feng, S. Hu, Z.K. Liu, P. Yu, X. Wang and J. Zhang) on the numerical algorithms for the phase field simulations of some interface problems, ranging from microstructure evolution in multicomponent alloy to multicomponent lipid vesicles. We discuss recent development of highly adaptive computational al...
متن کاملSome Prospects for Efficient Fixed Parameter Algorithms
Recent time has seen quite some progress in the development of exponential time algorithms for NP-hard problems, where the base of the exponential term is fairly small. These developments are also tightly related to the theory of xed parameter tractability. In this incomplete survey, we explain some basic techniques in the design of eecient xed parameter algorithms, discuss deeciencies of param...
متن کاملFPT-algorithms for some problems related to integer programming
In this paper, we present FPT-algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices included in the problems' formulations are near square. The parameter is the maximum absolute value of rank minors of the corresponding matrices. Additionally, we present FPT-algorithms with respect to the same parameter for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 1989
ISSN: 0001-5903,1432-0525
DOI: 10.1007/bf00265152